Error Estimate of a Subdivision Scheme with a Truncated Refinement Mask

نویسندگان

  • Bin Han
  • BIN HAN
چکیده

Given a finitely supported refinement mask on Zs with irrational coefficients, in many applications, we need to truncate the irrational coefficients in the refinement mask to rational numbers. This note provides a sharp error estimate in the Lp (1 ≤ p ≤ ∞) norm sense of a multivariate subdivision scheme caused by truncation of an original refinement mask. Examples are provided to illustrate that the estimate in this note is optimal. Finally, we partially extend this estimate to the case when a refinement mask has infinite support. §

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vector subdivision schemes and multiple wavelets

We consider solutions of a system of refinement equations written in the form φ = ∑ α∈Z a(α)φ(2 · −α), where the vector of functions φ = (φ1, . . . , φr)T is in (Lp(R)) and a is a finitely supported sequence of r × r matrices called the refinement mask. Associated with the mask a is a linear operator Qa defined on (Lp(R)) by Qaf := ∑ α∈Z a(α)f(2 · −α). This paper is concerned with the convergen...

متن کامل

REVERSE LOOP SUBDIVISION FOR GEOMETRY AND TEXTURES

Reverse subdivision aims at constructing a coarser representation of an object given by a fine polygon mesh. In this paper, we first derive a mask for reverse Loop subdivision that can be applied to both regular and extraordinary vertices. The mask is parameterized, and thus can also be used in reversing variants of Loop subdivision, such as those proposed by Warren and Litke. We apply this mas...

متن کامل

Error bounds for a class of subdivision schemes based on the two-scale refinement equation

Subdivision schemes are iterative procedures to construct curves and constitute fundamental tools in Computer Aided Design. Starting with an initial control polygon, a subdivision scheme refines the computed values at the previous step according to some basic rules. The scheme is said to be convergent if there exists a limit curve. The computed values define a control polygon in each step. This...

متن کامل

The Initial Functions in a Subdivision Scheme

In this paper we shall study the initial functions in a subdivision scheme in a Sobolev space. By investigating the mutual relations among the initial functions in a subdivision scheme, we are able to study in a relatively uniied approach several questions related to a subdivision scheme in a Sobolev space such as convergence, error estimate and convergence rate of a subdivision scheme in a Sob...

متن کامل

The Mask of Odd Points n-Ary Interpolating Subdivision Scheme

We present an explicit formula for the mask of odd points n-ary, for any odd n 3, interpolating subdivision schemes. This formula provides the mask of lower and higher arity schemes. The 3-point and 5-point a-ary schemes introduced by Lian, 2008, and 2m 1 -point a-ary schemes introduced by, Lian, 2009, are special cases of our explicit formula. Moreover, other well-known existing odd point n-ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997